On the Complementation of Asynchronous Cellular Büchi Automata
نویسنده
چکیده
We present direct subset automata constructions for asynchronous (asyn-chronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of nite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular B uchi automata for innnite traces. Both constructions yield a super-exponential blow-up in the size of local states sets.
منابع مشابه
Determinizing Asynchronous Automata on Infinite Inputs
Asynchronous automata are a natural distributed machine model for recognizing trace languages—languages defined over an alphabet equipped with an independence relation. To handle infinite traces, Gastin and Petit introduced Büchi asynchronous automata, which accept precisely the class of ω-regular trace languages. Like their sequential counterparts, these automata need to be non-deterministic i...
متن کاملTight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Generalised Büchi automata are Büchi automata with multiple accepting sets. They form a class of automata that naturally occurs, e.g., in the translation from LTL to ω-automata. In this paper, we extend current determinisation techniques for Büchi automata to generalised Büchi automata and prove that our determinisation is optimal. We show how our optimal determinisation technique can be used a...
متن کاملComplementation Constructions for Nondeterministic Automata on Infinite Words
The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis tech...
متن کاملDeterminization Complexities of ω Automata
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexity, namely Θ(2) where n is the state size. The same similarity between determinization and comple...
متن کاملBüchi Complementation Made Tight
The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple – it suffices to determinize them using a simple subset construction and to dualize the acceptance condition of the resulting automaton – Büchi complementation is more involved. Indeed, the construction of an EXPTIME complemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 169 شماره
صفحات -
تاریخ انتشار 1996